On Exact Sequence of Semimodules over Semirings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Idempotent Subreducts of Semimodules over Commutative Semirings

A short proof of the characterization of idempotent subreducts of semimodules over commutative semirings is presented. It says that an idempotent algebra embeds into a semimodule over a commutative semiring, if and only if it belongs to the variety of Szendrei modes.

متن کامل

Further Galois Connections between Semimodules over Idempotent Semirings

In [14] a generalisation of Formal Concept Analysis was introduced with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the standard Boolean carrier set. The construction leading to the pair of dually (order) isomorphic lattices can be further manipulated to obtain the three other types of Galois Connections pro...

متن کامل

Lexicographic Semirings for Exact Automata Encoding of Sequence Models

In this paper we introduce a novel use of the lexicographic semiring and motivate its use for speech and language processing tasks. We prove that the semiring allows for exact encoding of backoff models with epsilon transitions. This allows for off-line optimization of exact models represented as large weighted finite-state transducers in contrast to implicit (on-line) failure transition repres...

متن کامل

On idempotent matrices over semirings

Idempotent matrices play a significant role while dealing with different questions in matrix theory and its applications. It is easy to see that over a field any idempotent matrix is similar to a diagonal matrix with 0 and 1 on the main diagonal. Over a semiring the situation is quite different. For example, the matrix J of all ones is idempotent over Boolean semiring. The first characterizatio...

متن کامل

Constraint Solving over Semirings

We introduce a general framework for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated to each tuple of values of the variable domain, and the two semiring operations (+ and x) model constraint proje...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISRN Algebra

سال: 2013

ISSN: 2090-6293

DOI: 10.1155/2013/156485